Graph rewriting with polarized cloning

Graph Transformation with Focus on Incident Edges

We tackle the problem of graph transformation with particular focus on node cloning. We propose a new approach to graph rewriting, called polarized node cloning, where a node may be cloned together with either all its incident edges or with only its outgoing edges or with only its incoming edges or with none of its incident edges. We thus subsume previous works such as the sesqui-pushout, the h...

Sesqui-Pushout Rewriting with Type Refinements

Sesqui-pushout rewriting is an algebraic graph transformation approach that provides mechanisms for vertex cloning. If a vertex gets cloned, the original and the copy obtain the same context, i.e. all incoming and outgoing edges of the original are copied as well. This behaviour is not satisfactory in practical examples which require more control over the context cloning process. In this paper,...

A Cloning Pushout Approach to Term-Graph Transformation

We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L,R, τ, σ) such that L and R are termgraphs representing the left-hand and the right-hand sides of the rule, τ is a mapping from the nodes of L to those of R and σ is a partial function from nodes of R to nodes of L. τ describes how incident edges of the nodes in L are co...

An Example of Cloning Graph Transformation Rules for Programming

Abstract Graphical notations are already popular for the design of software, as witnessed by the success of the Uniform Modeling Languages (UML). In this paper, we advocate the use of graphs and graph transformation for programming graph-based systems. Our case study, the flattening of hierarchical statecharts, reveals that cloning, a recently proposed transformation concept, makes graph transf...

Complete Growth Series of Coxeter Groups with more than Three Generators